http://www.ams.org/mathscinet-getitem?mr=854604

MR854604 (87k:05062) 05C05 (05C35) 
Erdös, Paul; Saks, Michael; Sós, Vera T. Maximum induced trees in graphs. J. Combin. Theory Ser. B 41 (1986), no. 1, 61--79.

MR1258993 (94m:68055) 68Q15 (90C09) 
Boros, E.; Crama, Y.; Hammer, P. L.; Saks, M. A complexity index for satisfiability problems. SIAM J. Comput. 23 (1994), no. 1, 45--49. 

MR1802521 90B35 (93C85) 
Crama, Y.; Kats, V.; van de Klundert, J.; Levner, E. Cyclic scheduling in robotic flowshops. Mathematics of industrial systems, IV (Valparaiso, 1996). Ann. Oper. Res. 96 (2000), 97--124. 

or

MR882607 (88e:05002) 05A05 
Erdös, P.; Linial, N.; Moran, S. Extremal problems on permutations under cyclic equivalence. Discrete Math. 64 (1987), no. 1, 1--11. 

MR1798045 68M10 (68M14) 
Dinitz, Yefim; Moran, Shlomo; Rajsbaum, Sergio Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract). Annual ACM Symposium on Theory of Computing (Atlanta, GA, 1999), 265--274 (electronic), ACM, New York, 1999.

MR446453 (56 #4778) 90B10 
{\cyr Adel\cprime son-Vel\cprime ski\u\i, G. M.}; {\cyr Dinits, E. A.}; {\cyr Karzanov, A. V.} {\cyr Potokovye algoritmy.} (Russian) [Flow algorithms] Izdat. ``Nauka'', Moscow, 1975. 119 pp. 

and

MR2029440 68Q25 (90B35) 
Adelson-Velsky, George M.; Gelbukh, Alexander; Levner, Eugene A fast scheduling algorithm in AND-OR graphs. Topics in applied and theoretical mathematics and computer science, 170--175, Math. Comput. Sci. Eng., WSEAS, Athens, 2001.